Multiobjective Optimization Software

نویسندگان

  • Silvia Poles
  • Mariana Vassileva
  • Daisuke Sasaki
چکیده

This chapter provides a description of multiobjective optimization software with a general overview of selected few available tools developed in the last decade. This chapter can be considered a revision of previous valid papers and chapters on nonlinear multiobjective optimization software such as the ones written by Weistroffer et al. (2005) and Miettinen (1999) that lists existing software packages up to the year 1999. More precisely, this chapter is focused on the tools and features that advisable multiobjective optimization software should contain.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Software project portfolio optimization with advanced multiobjective evolutionary algorithms

Large software companies have to plan their project portfolio to maximize potential portfolio return and strategic alignment, while balancing various preferences, and considering limited resources. Project portfolio managers need methods and tools to find a good solution for complex project portfolios and multiobjective target criteria efficiently. However, software project portfolios are chall...

متن کامل

Genetic Algorithms Applied to Real Time Multiobjective Optimization Problems

Genetic algorithms are often well suited for multiobjective optimization problems. In this work, multiple objectives pertaining to the THUNDER software were concerned to optimize the war results obtained from the software. It is a stochastic, two-sided, analytical simulation of military operations. The simulation is subject to internal unknown noises. Due to these noises and discreetness in the...

متن کامل

Tabu Programming for Multiobjective Optimization Problems

In this paper, tabu programming for solving multiobjective optimization problems has been considered. Tabu search algorithm has been extended by using a computer program instead of a mathematical variable. For finding Paretooptimal solutions, the ranking procedure in the neighborhood of the current solutions has been applied. Moreover, the multiobjective optimization problem of task assignment ...

متن کامل

Quasi-Newton Methods for Nonconvex Constrained Multiobjective Optimization

Here, a quasi-Newton algorithm for constrained multiobjective optimization is proposed. Under suitable assumptions, global convergence of the algorithm is established.

متن کامل

An algorithm for approximating nondominated points of convex multiobjective optimization problems

‎In this paper‎, ‎we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP)‎, ‎where the constraints and the objective functions are convex‎. ‎We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points‎. ‎The proposed algorithm can be appl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008